Symbolic Shortest Paths Planning
نویسنده
چکیده
This paper studies the impact of pattern databases for solving shortest path planning problems with limited memory. It contributes a bucket implementation of Dijkstra’s algorithm for the construction of shortest path planning pattern databases and their use in symbolic A* search. For improved efficiency, the paper analyzes the locality for weighted problem graphs and shows that it matches the duplicate detection scope in best-first search graphs. Cost-optimal plans for compiled competition benchmark domains are computed.
منابع مشابه
Any-Angle Path Planning
In robotics and video games, one often discretizes continuous terrain into a grid with blocked and unblocked grid cells and then uses path-planning algorithms to find a shortest path on the resulting grid graph. This path, however, is typically not a shortest path in the continuous terrain. In this overview article, we discuss a path-planning methodology for quickly finding paths in continuous ...
متن کاملA Symbolic Approach to the All-Pairs Shortest-Paths Problem
Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, specialized symbolic algorithms are needed which are restricted to the use of functional operations offered by the OBDD data structure. In this paper, a symbolic algorithm for the all-pairs shortest-paths (APSP) problem in loop...
متن کاملUsing Edge-Valued Decision Diagrams for Symbolic Generation of Shortest Paths
We present a new method for the symbolic construction of shortest paths in reachability graphs. Our algorithm relies on a variant of edge–valued decision diagrams that supports efficient fixed–point iterations for the joint computation of both the reachable states and their distance from the initial states. Once the distance function is known, a shortest path from an initial state to a state sa...
متن کاملLazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D
Grids with blocked and unblocked cells are often used to represent continuous 2D and 3D environments in robotics and video games. The shortest paths formed by the edges of 8neighbor 2D grids can be up to ≈ 8% longer than the shortest paths in the continuous environment. Theta* typically finds much shorter paths than that by propagating information along graph edges (to achieve short runtimes) w...
متن کاملRoute Planning for Bicycles - Exact Constrained Shortest Paths Made Practical via Contraction Hierarchy
We consider the problem of computing shortest paths subject to an additional resource constraint such as a hard limit on the (positive) height difference of the path. This is typically of interest in the context of bicycle route planning, or when energy consumption is to be limited. So far, the exact computation of such constrained shortest paths was not feasible on large networks; we show that...
متن کامل